Periodicity of quantum walks defined by mixed paths and mixed cycles

Lively quantum walks on cycles

We introduce a family of quantum walks on cycles parametrized by their liveliness, defined as the ability to execute a long-range move. We investigate the behavior of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a ...

Random Walks and Mixed Volumes of Hypersimplices

Below is a method for relating a mixed volume computation for polytopes sharing many facet directions to a symmetric random walk. The example of permutahedra and particularly hypersimplices is expanded upon.

on the status of mixed methods research in applied linguistics

چکیده ندارد.

Bioleaching of Copper from Low-Grade Ore Using Isolated Bacteria and Defined Mixed Cultures

Characterization of signed paths and cycles admitting minus dominating function

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.